Up-to techniques for behavioural metrics via fibrations

نویسندگان

چکیده

Abstract Up-to techniques are a well-known method for enhancing coinductive proofs of behavioural equivalences. We introduce up-to metrics between systems modelled as coalgebras, and we provide abstract results to prove their soundness in compositional way. In order obtain general framework, need systematic way lift functors: show that the Wasserstein lifting functor, introduced previous work, corresponds change base fibrational sense. This observation enables us reuse existing about setting. focus on fibrations predicates relations valued quantale. To illustrate our approach, an example distances regular languages.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Up-To Techniques for Generalized Bisimulation Metrics

Bisimulation metrics allow us to compute distances between the behaviors of probabilistic systems. In this paper we present enhancements of the proof method based on bisimulation metrics, by extending the theory of up-to techniques to (pre)metrics on discrete probabilistic concurrent processes. Up-to techniques have proved to be a powerful proof method for showing that two systems are bisimilar...

متن کامل

Classifying Smooth Lattice Polytopes via Toric Fibrations

We show that any smooth Q-normal lattice polytope P of dimension n and degree d is a strict Cayley polytope if n ≥ 2d+ 1. This gives a sharp answer, for this class of polytopes, to a question raised by V. V. Batyrev and B. Nill.

متن کامل

Using randomization techniques to analyse behavioural data

Data from behavioural studies are frequently non-normally distributed and cannot be analysed with traditional parametric statistics. Instead, behaviourists must rely on rank-transformation tests, which lose potentially valuable information present in the data. Recently, however, biologists in other disciplines have resolved similar statistical difficulties by using resampling methods. Results f...

متن کامل

Coalgebraic Up-to Techniques

A simple algorithm for checking language equivalence of finite automata consists in trying to compute a bisimulation that relates them. This is possible because language equivalence can be characterised coinductively, as the largest bisimulation. More precisely, consider an automaton 〈S, t, o〉, where S is a (finite) set of states, t : S → P(S) is a non-deterministic transition function, and o :...

متن کامل

Up-to Techniques for Weak Bisimulation

Up-to techniques have been introduced to enhance the bisimulation proof method for establishing bisimilarity results. While up-to techniques for strong bisimilarity are well understood, in the weak case they come as a collection of unrelated results, and lack a unified presentation. We propose a uniform and modular theory of up-to techniques for weak bisimulation that captures existing proof te...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Structures in Computer Science

سال: 2023

ISSN: ['1469-8072', '0960-1295']

DOI: https://doi.org/10.1017/s0960129523000166